Proof complexity

Results: 225



#Item
41A complexity analysis of functional interpretations 1 Mircea-Dan HERNEST a,2 and Ulrich KOHLENBACH b,3 a Laboratoire  ´

A complexity analysis of functional interpretations 1 Mircea-Dan HERNEST a,2 and Ulrich KOHLENBACH b,3 a Laboratoire ´

Add to Reading List

Source URL: www.mathematik.tu-darmstadt.de

Language: English - Date: 2012-08-23 09:24:17
42Equihash: Asymmetric Proof-of-Work Based on the Generalized Birthday Problem Alex Biryukov Dmitry Khovratovich

Equihash: Asymmetric Proof-of-Work Based on the Generalized Birthday Problem Alex Biryukov Dmitry Khovratovich

Add to Reading List

Source URL: www.internetsociety.org

Language: English - Date: 2016-02-22 10:06:03
43Approximability and proof complexity Ryan O’Donnell∗ Yuan Zhou†  November 7, 2012

Approximability and proof complexity Ryan O’Donnell∗ Yuan Zhou† November 7, 2012

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2012-11-07 23:45:14
    44Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004

    Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004

    Add to Reading List

    Source URL: vigna.di.unimi.it

    Language: English - Date: 2008-02-01 14:51:28
    45Online Learning for Time Series Prediction Elad Hazan Shie Mannor  Ohad Shamir

    Online Learning for Time Series Prediction Elad Hazan Shie Mannor Ohad Shamir

    Add to Reading List

    Source URL: arxiv.org

    Language: English - Date: 2013-02-27 20:17:13
    46Private Client-Side Profiling with Random Forests and Hidden Markov Models George Danezis1 , Markulf Kohlweiss1 , Benjamin Livshits1 , and Alfredo Rial2 1  2

    Private Client-Side Profiling with Random Forests and Hidden Markov Models George Danezis1 , Markulf Kohlweiss1 , Benjamin Livshits1 , and Alfredo Rial2 1 2

    Add to Reading List

    Source URL: www0.cs.ucl.ac.uk

    Language: English - Date: 2013-10-10 06:48:57
    47A A New Kind of Tradeoffs in Propositional Proof Complexity ALEXANDER RAZBOROV We exhibit an unusually strong tradeoff in propositional proof complexity that significantly deviates from the established pattern of almost

    A A New Kind of Tradeoffs in Propositional Proof Complexity ALEXANDER RAZBOROV We exhibit an unusually strong tradeoff in propositional proof complexity that significantly deviates from the established pattern of almost

    Add to Reading List

    Source URL: people.cs.uchicago.edu

    Language: English - Date: 2015-12-22 09:16:59
      48Propositional Proof Complexity Instructor: Alexander Razborov, University of Chicago.  Course Homepage: http://people.cs.uchicago.edu/~razborov/teaching/winter09.html Winter, 2009 and Winter, 2014

      Propositional Proof Complexity Instructor: Alexander Razborov, University of Chicago. Course Homepage: http://people.cs.uchicago.edu/~razborov/teaching/winter09.html Winter, 2009 and Winter, 2014

      Add to Reading List

      Source URL: people.cs.uchicago.edu

      Language: English - Date: 2014-04-04 16:32:05
        49Corrections for  Logical Foundations of Proof Complexity Stephen Cook and Phuong Nguyen ASL Perspectives in Logic Series Cambridge University Press, 2010.

        Corrections for Logical Foundations of Proof Complexity Stephen Cook and Phuong Nguyen ASL Perspectives in Logic Series Cambridge University Press, 2010.

        Add to Reading List

        Source URL: www.cs.toronto.edu

        Language: English - Date: 2013-12-06 10:50:09
          50Power of Non-Uniformity in Proof Complexity  by Steven Perron

          Power of Non-Uniformity in Proof Complexity by Steven Perron

          Add to Reading List

          Source URL: tspace.library.utoronto.ca

          Language: English - Date: 2013-10-10 11:40:05